Anytime Inference in Valuation Algebras

نویسندگان

  • Abhishek Dasgupta
  • Samson Abramsky
چکیده

The novel contribution of this work is the construction of anytime algorithms in a generic framework, which automatically gives us instantiations in many useful domains. We also show that semiring induced valuation algebras, an important subclass of valuation algebras are amenable to anytime inference. Anytime inference, and inference algorithms in general have been a well-researched area in the last few decades. Inference is an important component in most pattern recognition and machine learning algorithms; it also shares theoretical connections with other branches of computer science like theorem-proving. Anytime inference is important in applications with limited space, for efficiency reasons, such as in continuous learning and robotics. In this article we construct an anytime inference algorithm based on principles introduced in the theory of generic inference; and in particular, extending the work done on ordered valuation algebras [5].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ordered valuation algebras: a generic framework for approximating inference

The paper presents a generic approach of approximating inference. The method is based on the concept of valuation algebras with its wide range of possible applications in many different domains. We present convenient resource-bounded anytime algorithms, where the maximal time of computation is determined by the user.

متن کامل

Resource-Bounded Local Computation

This paper proposes a generic approximation method for solving the problem of inference under limited computational resources. The method is based on the concept of valuation algebras with its wide range of possible instantiations in many different domains. The goal is to construct convenient resource-bounded anytime algorithms, for which the available time to perform the local computations is ...

متن کامل

Computation in Valuation Algebras

Many different formalisms for treating uncertainty or, more generally, information and knowledge, have a common underlying algebraic structure. The essential algebraic operations are combination, which corresponds to aggregation of knowledge, and marginalization, which corresponds to focusing of knowledge. This structure is called a valuation algebra. Besides managing uncertainty in expert syst...

متن کامل

A generic Architecture for local Computation

Valuation algebras are known to present a common roof over various applications out of different domains of research. In combination with the power of local computation it offers a possibility to solve inference problems in an efficient way. Implementing concretely these concepts by instantiating a valuation algebra means loosing the high level of abstraction. This paper presents a generic real...

متن کامل

Optimizing Inference in Bayesian Networks and Semiring Valuation Algebras

Previous work on context-specific independence in Bayesian networks is driven by a common goal, namely to represent the conditional probability tables in a most compact way. In this paper, we argue from the view point of the knowledge compilation map and conclude that the language of Ordered Binary Decision Diagrams (OBDD) is the most suitable one for representing probability tables, in additio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1605.04218  شماره 

صفحات  -

تاریخ انتشار 2016